Model-checking games for fixpoint logics with partial order models

Model-Checking Games for Fixpoint Logics with Partial Order Models

We introduce model-checking games that allow local second-order power on sets of independent transitions in the underlying partial order models where the games are played. Since the interleaving semantics of such models is not considered, some problems that may arise when using interleaving representations are avoided and new decidability results for partial order models are achieved. The games...

Model Checking Games for Branching Time Logics

This paper defines and examines model checking games for the branching time temporal logic CTL∗. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimisations are considered to obtain model checking games for impo...

Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics

While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of...

Model Checking with the Partial Order Reduction

Publications: Partial Order Model Checking